Inversion of 2D cellular automata: some complexity results
نویسندگان
چکیده
منابع مشابه
Inversion of 2d Cellular Automata: Some Complexity Results Inversion of 2d Cellular Automata: Some Complexity Results
In this paper, we prove the co-NP-completeness of the following decision problem: \given a 2-dimensional cellular automaton A, is A injective when restricted to nite conngurations not greater than its length?" In order to prove this result, we introduce two decision problems concerning respectively Turing Machines and tilings that we prove NP-complete. We then present a transformation of proble...
متن کاملInversion of 2D Cellular Automata: Some Complexity Results
Durand, B. Inversion of 2D cellular automata: some complexity results, Theoretical Computer Science 134 (1994) 387401. In this paper, we prove the co-NP-completeness of the following decision problem: “Given a twodimensional cellular automaton & (even with Von Neumann neighborhood), is & injective when restricted to finite configurations not greater than its length?” In order to prove this resu...
متن کاملSome Results on Invertible Cellular Automata
A bst ract . V-Ie address certain questions concern ing invert ible cellular aut omata (ICA) , and present new results in this area . Specifically, we explicitly const ru ct a cellular automaton (CA) in a class (r esidual clas s) previously known not to be empty only via a nonconstr uctive existe nce proof. T his class contains CAs that are invert ible on every fini te suppor t but not on an in...
متن کاملSpatial Complexity Measure for Characterising Cellular Automata Generated 2D Patterns
Cellular automata (CA) are known for their capacity to generate complex patterns through the local interaction of rules. Often the generated patterns, especially with multi-state two-dimensional CA, can exhibit interesting emergent behaviour. This paper addresses quantitative evaluation of spatial characteristics of CA generated patterns. It is suggested that the structural characteristics of t...
متن کاملSimulating 3D Cellular Automata with 2D Cellular Automata
The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise when changing the dimension, propose solutions and discuss the main properties of the obtained simulation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90244-5